Sparse Implementation of Revised Simplex Algorithmson
نویسنده
چکیده
Parallelizing sparse simplex algorithms is one of the most challenging problems. Because of very sparse matrices and very heavy communication, the ratio of computation to communication is extremely low. It becomes necessary to carefully select parallel algorithms , partitioning patterns, and communication optimization to achieve a speedup. Two implementations on Intel hypercubes are presented in this paper. The experimental results show that a nearly linear speedup can be obtained with the basic revised simplex algorithm. However, the basic revised simplex algorithm has many ll-ins. We also implement a revised simplex algorithm with LU decomposition. It is a very sparse algorithm, and it is very diicult to achieve a speedup with it.
منابع مشابه
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it
The revised simplex method is often the method of choice when solving large scale sparse linear programming problems, particularly when a family of closely-related problems is to be solved. Each iteration of the revised simplex method requires the solution of two linear systems and a matrix vector product. For a significant number of practical problems the result of one or more of these operati...
متن کاملCOAP 2015 Best Paper Prize
Each year, the editorial board of computational optimization and applications (COAP) selects a paper from the preceding year’s publications for the Best Paper Award. In 2015, 92 papers were published by COAP. The recipients of the 2015 Best Paper Award are Qi Huangfu of the FICO Xpress Team and Julian Hall of the University of Edinburgh for their paper “Novel update techniques for the revised s...
متن کاملA High Performance Dual Revised Simplex Solver
When solving families of related linear programming (LP) problems and many classes of single LP problems, the simplex method is the preferred computational technique. Hitherto there has been no efficient parallel implementation of the simplex method that gives good speed-up on general, large sparse LP problems. This paper presents a variant of the dual simplex method and a prototype parallelisa...
متن کاملNovel update techniques for the revised simplex method
This paper introduces three novel techniques for updating the invertible representation of the basis matrix when solving practical sparse linear programming (LP) problems using a high performance implementation of the dual revised simplex method, being of particular value when suboptimization is used. Two are variants of the product form update and the other permits multiple Forrest-Tomlin upda...
متن کاملParallelizing the dual revised simplex method
This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and exploits parallelism across multiple iterations. The other, called SIP, exploits purely single iteration parallelism by overlapping computational c...
متن کامل